#include<bits/stdc++.h>
using namespace std;
const int N=1e6+10;
int a[N];
bool del[N],gj[N];
int main()
{
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    cin>>a[i];
    sort(a+1,a+n+1);
    int j=1;
    for(int i=1;i<=n;i++)
    {
        while((a[j]<=a[i]||gj[j]==1)&&j<=n)
            j++;
        if(j>n)
        {
            cout<<n-i+1<<endl;
            break;
        }
        else
        gj[j]=1;
    }
    return  0;
}
